翻訳と辞書
Words near each other
・ Bellister Castle
・ Bellite
・ Bellitepe, Göle
・ Bellium
・ Belliveau's Cove, Nova Scotia
・ Bellizzi
・ Bellmac 32
・ Bellmaking
・ Bellman
・ Bellman (surname)
・ Bellman and True
・ Bellman equation
・ Bellman hangar
・ Bellman joke
・ Bellman Prize
Bellman pseudospectral method
・ Bellman's Cave
・ Bellman's Head
・ Bellmansro
・ Bellmanstafetten
・ Bellman–Ford algorithm
・ Bellmark Records
・ Bellmawr School District
・ Bellmawr, New Jersey
・ Bellmead, Texas
・ Bellmer Dolls
・ Bellmere, Queensland
・ Bellmont
・ Bellmont High School
・ Bellmont Precinct, Wabash County, Illinois


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Bellman pseudospectral method : ウィキペディア英語版
Bellman pseudospectral method
The Bellman pseudospectral method is a pseudospectral method for optimal control based on Bellman's principle of optimality. It is part of the larger theory of pseudospectral optimal control, a term coined by Ross. The method is named after Richard E. Bellman. It was introduced by Ross et al.〔I. M. Ross, Q. Gong and P. Sekhavat, The Bellman pseudospectral method, AIAA/AAS Astrodynamics Specialist Conference and Exhibit, Honolulu, Hawaii, AIAA-2008-6448, August 18–21, 2008.〕
first as a means to solve multiscale optimal control problems, and later expanded to obtain suboptimal solutions for general optimal control problems.
==Theoretical foundations==
The multiscale version of the Bellman pseudospectral mehod is based on the spectral convergence property of the Ross–Fahroo pseudospectral methods. That is, because the Ross–Fahroo pseudospectral method converges at an exponentially fast rate, pointwise convergence to a solution is obtained at very low number of nodes even when the solution has high-frequency components. This aliasing phenomenon in optimal control was first discovered by Ross et al.〔 Rather than use signal processing techniques to anti-alias the solution, Ross et al. proposed that Bellman's principle of optimality can be applied to the converged solution to extract information between the nodes. Because the Gauss–Lobatto nodes cluser at the boundary points, Ross et al. suggested that if the node density around the initial conditions satisfy the Nyquist–Shannon sampling theorem, then the complete solution can be recovered by solving the optimal control problem in a recursive fashion over piecewise segments known as Bellman segments.〔
In an expanded version of the method, Ross et al.,〔 proposed that method could also be used to generate feasible solutions that were not necessarily optimal. In this version, one can apply the Bellman pseudospectral method at even lower number of nodes even under the knowledge that the solution may not have converged to the optimal one. In this situation, one obtains a feasible solution.
A remarkable feature of the Bellman pseudospectral method is that it automatically determines several measures of suboptimality based on the original pseudospectral cost and the cost generated by the sum of the Bellman segments.〔〔

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Bellman pseudospectral method」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.